-
1 Ford — Fulkerson algorithm
Форда — Фалкерсона алгоритм
Способ решения задачи построения максимального потока в сети. (Поток в сети определяется пропускной способностью ее дуг от начальной вершины до конечной вершины.). Алгоритм Л.Форда и Д.Фалкерсона применяется, например, при решении транспортной задачи: требуется перевезти из начальной вершины сети в конечную груз по дугам сети за минимальное время. При этом по каждой дуге нельзя перевозить груза больше фиксированного объема.
[ http://slovar-lopatnikov.ru/]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > Ford — Fulkerson algorithm
-
2 Ford-Fulkerson algorithm
Математика: алгоритм Форда-ФалкерсонаУниверсальный англо-русский словарь > Ford-Fulkerson algorithm
-
3 Ford-Fulkerson algorithm
алгоритм Беллмана-Форда, алгоритм Форда-Фалкерсона (напр. для маршрутизации)English-Russian electronics dictionary > Ford-Fulkerson algorithm
-
4 Ford-Fulkerson algorithm
алгоритм Беллмана-Форда, алгоритм Форда-Фалкерсона (напр. для маршрутизации)The New English-Russian Dictionary of Radio-electronics > Ford-Fulkerson algorithm
-
5 algorithm
1) алгоритм2) правило; процедура; метод•- adaptive algorithm
- Agarval-Cooley algorithm
- aim algorithm
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- backoff algorithm
- back propagation of error algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm - CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm - greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm - iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-Moore algorithm
- Lee algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm - min-cut algorithm - nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- quantum search algorithm
- quick-union algorithm
- quick-union algorithm with path compression
- Q-R-algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm - routing algorithm
- Rprop algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm - self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm - shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithm -
6 algorithm
1) алгоритм2) правило; процедура; метод•- Agarval-Cooley algorithm
- aim algorithm
- algorithm of doubtful convergence
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- back propagation of error algorithm
- backoff algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm
- British Telecom Lempel-Ziv algorithm
- BTLZ algorithm
- CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm
- genetic algorithm
- graph search algorithm
- greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm
- international data encryption algorithm
- iterative algorithm
- iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-algorithm
- Lee-Moore algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm
- message authentication algorithm
- metaheuristic algorithm
- min-cut algorithm
- modified Gram-Schmidt algorithm
- Nelder-Mead simplex algorithm
- nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- Q-R-algorithm
- quantum search algorithm
- quick-union algorithm with path compression
- quick-union algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm
- Rivest-Shamir-Adleman algorithm
- robust algorithm
- routing algorithm
- RProp algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm
- secure hash algorithm
- selective-trace algorithm
- self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm
- sequential leader clustering algorithm
- serial algorithm
- shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithmThe New English-Russian Dictionary of Radio-electronics > algorithm
См. также в других словарях:
Ford-Fulkerson algorithm — The Ford Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum flow in a flow network. It was published in 1956. The name Ford Fulkerson is often also used for the Edmonds Karp algorithm, which is a… … Wikipedia
Algoritmo de Ford-Fulkerson — El algoritmo de Ford Fulkerson propone buscar caminos en los que se pueda aumentar el flujo, hasta que se alcance el flujo máximo. Es aplicable a los Flujos maximales. La idea es encontrar una ruta de penetración con un flujo positivo neto que… … Wikipedia Español
Algorithme De Ford-Fulkerson — L algorithme de Ford Fulkerson, du nom de ses auteurs L.R. Ford et D.R. Fulkerson, consiste en une procédure itérative qui permet de déterminer un flux (ou flot) de valeur maximale (ou minimale) à partir d un flot constaté. Il s agit donc d un… … Wikipédia en Français
Algorithme de ford-fulkerson — L algorithme de Ford Fulkerson, du nom de ses auteurs L.R. Ford et D.R. Fulkerson, consiste en une procédure itérative qui permet de déterminer un flux (ou flot) de valeur maximale (ou minimale) à partir d un flot constaté. Il s agit donc d un… … Wikipédia en Français
Algorithme de Ford-Fulkerson — L algorithme de Ford Fulkerson, du nom de ses auteurs L.R. Ford et D.R. Fulkerson, consiste en une procédure itérative qui permet de déterminer un flot (ou flux) de valeur maximale (ou minimale) à partir d un flot constaté. Il s agit donc d un… … Wikipédia en Français
D. R. Fulkerson — Delbert Ray Fulkerson (August 14, 1924 – January 10, 1976) was a mathematician who co developed the Ford Fulkerson algorithm, one of the most well known algorithms to solve the maximum flow problem in networks. Fulkerson was brought up in small… … Wikipedia
Edmonds-Karp algorithm — In computer science and graph theory, the Edmonds Karp algorithm is an implementation of the Ford Fulkerson method for computing the maximum flow in a flow network in mathcal{O}(|V| cdot |E|^2). It is asymptotically slower than the relabel to… … Wikipedia
Dinic's algorithm — is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim Dinitz. The algorithm runs in O(V2E) time and is similar to the Edmonds–Karp algorithm,… … Wikipedia
L. R. Ford, Jr. — Lester Randolph Ford, Jr. (born September 23, 1927) is an American mathematician specializing in network flow programming, and son of Lester R. Ford, Sr.. His 1956 paper with D. R. Fulkerson on the maximum flow problem established the maxflow… … Wikipedia
Algorithmus von Ford und Fulkerson — Der Algorithmus von Ford und Fulkerson (nach seinen Erfindern Lester Randolph Ford junior und Delbert Ray Fulkerson[1]) dient der Berechnung eines maximalen s t Flusses in einem Netzwerk. Er sucht sukzessiv nach flussvergrößernden Pfaden im… … Deutsch Wikipedia
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia